منابع مشابه
Refining Action Theories through Abductive Logic Programming
Reasoning about actions and changes often starts with an action theory which is then used for planning, prediction or explanation. In practice it is sometimes not simple to give an immediately available action theory. In this paper we will present an abductive methodology for describing action domains. We start with an action theory which is not complete, i.e., has more than one model. Then, af...
متن کاملProgramming Multiagent Systems without Programming Agents
We consider the programming of multiagent systems from an architectural perspective. Our perspective emphasizes the autonomy and heterogeneity of agents, the components of multiagent systems, and focuses on how to specify their interconnections in terms of high-level protocols. In this manner, we show how to treat the programming of a multiagent system as an architectural endeavor, leaving asid...
متن کاملProgramming with Logic without Logic Programming
We extend a logic-based agent and production system language, LPS, from the single agent to the multi-agent case in which agents coordinate their behaviour through the medium of a shared state, which is viewed as a model-theoretic structure. In the extended language MALPS, each agent can be viewed as a collection of reactive rules: conditions conclusions, which have both a procedural and a de...
متن کاملRefining High Performance FORTRAN Code from Programming Model Dependencies
For next generation applications, programmers will be required to adapt to a new style of programming to utilize the parallelism in the processors available to them. Abstractions in parallel programming languages and directives or annotations in sequential code have shown initial promise in reducing some of the burden of parallel programming. However, even with all of these advances, parallel p...
متن کاملProgramming in logic without logic programming
In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.282.4